Restricted completion of sparse partial Latin squares
نویسندگان
چکیده
منابع مشابه
Restricted completion of sparse partial Latin squares
An n× n partial Latin square P is called α-dense if each row and column has at most αn non-empty cells and each symbol occurs at most αn times in P . An n× n array A where each cell contains a subset of {1, . . . , n} is a (βn, βn, βn)-array if each symbol occurs at most βn times in each row and column and each cell contains a set of size at most βn. Combining the notions of completing partial ...
متن کاملCompletion of Partial Latin Squares
In this thesis, the problem of completing partial latin squares is examined. In particular, the completion problem for three primary classes of partial latin squares is investigated. First, the theorem of Marshall Hall regarding completions of latin rectangles is discussed. Secondly, a proof of Evans’ conjecture is presented, which deals with partial latin squares of order n containing at most ...
متن کاملThe completion of partial Latin squares
In recent times there has been some interest in studying partial latin squares which have no completions or precisely one completion, and which are critical with respect to this property. Such squares are called, respectively, premature partial latin squares and critical sets. There has also been interest in related maximal partial latin squares. This paper will explore the connection between t...
متن کاملOn the Completion of Partial Latin Squares
In this paper a certain condition on partial latin squares is shown to be sufficient to guarantee that the partial square can be completed, namely, that it have fewer than n entries, and that at most [(n + I)/21 of these lie off some line,where n is the order of the square. This is applied to establish that the Evans conjecture is true for n < 8; i.e., that given a partial latin square of order...
متن کاملConstrained completion of partial latin squares
In this paper, we combine the notions of completing and avoiding partial latin squares. Let P be a partial latin square of order n and let Q be the set of partial latin squares of order n that avoid P . We say that P is Q -completable if P can be completed to a latin square that avoids Q ∈ Q. We prove that if P has order 4t and contains at most t − 1 entries, then P is Q -completable for each Q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2019
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s096354831800055x